Probe threshold and probe trivially perfect graphs
نویسندگان
چکیده
منابع مشابه
Probe threshold and probe trivially perfect graphs
7 An undirected graph G = (V,E) is a probe C graph if its vertex set can be partitioned 8 into two sets, N (non-probes) and P (probes) where N is independent and there 9 exists E′ ⊆ N × N such that G′ = (V,E ∪ E′) is a C graph. In this article we 10 investigate probe threshold and probe trivially perfect graphs and characterise them 11 in terms of certain 2-Sat formulas and in other ways. For t...
متن کاملComputing square roots of trivially perfect and threshold graphs
A graph H is a square root of a graph G if two vertices are adjacent in G if and only if they are at distance one or two in H . Computing a square root of a given graph is NP-hard, even when the input graph is restricted to be chordal. In this paper, we show that computing a square root can be done in linear time for a well-known subclass of chordal graphs, the class of trivially perfect graphs...
متن کاملA new characterization of trivially perfect graphs
A graph G is trivially perfect if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number) α(G) equals the number of (maximal) cliques m(G). We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.
متن کاملLinear-time certifying algorithms for recognizing trivially perfect graphs
We give the first linear-time certifying algorithms to recognize trivially perfect graphs, with sublinear certificates for negative output. In case of membership in the class of trivially perfect graphs, our algorithms provide as certificate a structure for the input graph that characterizes the class, and in case of non-membership they provide as certificate a forbidden induced subgraph of the...
متن کاملChordal Probe Graphs
In this paper, we introduce the class of chordal probe graphs which are a generalization of both interval probe graphs and chordal graphs. A graph G is chordal probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N is a stable set and such that G can be extended to a chordal graph by adding edges between non-probes. We show that chordal probe graphs may con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.06.029